A novel triangulation procedure for thinning hand-written text
Identifieur interne : 001A51 ( Main/Exploration ); précédent : 001A50; suivant : 001A52A novel triangulation procedure for thinning hand-written text
Auteurs : M. Melhi [Royaume-Uni] ; S. S Ipson [Royaume-Uni] ; W. Booth [Royaume-Uni]Source :
- Pattern Recognition Letters [ 0167-8655 ] ; 1999.
Abstract
This paper describes a novel procedure for thinning binary text images by generating graphical representations of words within the image. A smoothed polygonal approximation of the boundaries of each word is first decomposed into a set of contiguous triangles. Each triangle is then classified into one of only three possible types from which a graph is generated that represents the topological features of the object. Joining graph points with straight lines generates a final polygon skeleton that, by construction, is one pixel wide and fully connected. Results of applying the procedure to thinning Arabic and English handwriting are presented. Comparisons of skeleton structure and execution time with results from alternative techniques are also presented. The procedure is considerably faster than the alternatives tested when the image resolution is greater than 600 dpi and the graphical representation often needed in subsequent recognition steps is available without further processing.
Url:
DOI: 10.1016/S0167-8655(01)00038-1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000372
- to stream Istex, to step Curation: 000367
- to stream Istex, to step Checkpoint: 001105
- to stream Main, to step Merge: 001B44
- to stream Main, to step Curation: 001A51
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A novel triangulation procedure for thinning hand-written text</title><author><name sortKey="Melhi, M" sort="Melhi, M" uniqKey="Melhi M" first="M" last="Melhi">M. Melhi</name></author><author><name sortKey="Ipson, S S" sort="Ipson, S S" uniqKey="Ipson S" first="S. S" last="Ipson">S. S Ipson</name></author><author><name sortKey="Booth, W" sort="Booth, W" uniqKey="Booth W" first="W" last="Booth">W. Booth</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8ADA2EE3530612EA49BBE1EF913C3D65360C5DE9</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1016/S0167-8655(01)00038-1</idno><idno type="url">https://api.istex.fr/document/8ADA2EE3530612EA49BBE1EF913C3D65360C5DE9/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000372</idno><idno type="wicri:Area/Istex/Curation">000367</idno><idno type="wicri:Area/Istex/Checkpoint">001105</idno><idno type="wicri:doubleKey">0167-8655:2001:Melhi M:a:novel:triangulation</idno><idno type="wicri:Area/Main/Merge">001B44</idno><idno type="wicri:Area/Main/Curation">001A51</idno><idno type="wicri:Area/Main/Exploration">001A51</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A novel triangulation procedure for thinning hand-written text</title><author><name sortKey="Melhi, M" sort="Melhi, M" uniqKey="Melhi M" first="M" last="Melhi">M. Melhi</name><affiliation wicri:level="1"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>Department of Electronic and Electrical Engineering, University of Bradford, Bradford BD7 1DP</wicri:regionArea><wicri:noRegion>Bradford BD7 1DP</wicri:noRegion></affiliation></author><author><name sortKey="Ipson, S S" sort="Ipson, S S" uniqKey="Ipson S" first="S. S" last="Ipson">S. S Ipson</name><affiliation wicri:level="1"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>Department of Electronic and Electrical Engineering, University of Bradford, Bradford BD7 1DP</wicri:regionArea><wicri:noRegion>Bradford BD7 1DP</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Royaume-Uni</country></affiliation></author><author><name sortKey="Booth, W" sort="Booth, W" uniqKey="Booth W" first="W" last="Booth">W. Booth</name><affiliation wicri:level="1"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>Department of Electronic and Electrical Engineering, University of Bradford, Bradford BD7 1DP</wicri:regionArea><wicri:noRegion>Bradford BD7 1DP</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Pattern Recognition Letters</title><title level="j" type="abbrev">PATREC</title><idno type="ISSN">0167-8655</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1999">1999</date><biblScope unit="volume">22</biblScope><biblScope unit="issue">10</biblScope><biblScope unit="page" from="1059">1059</biblScope><biblScope unit="page" to="1071">1071</biblScope></imprint><idno type="ISSN">0167-8655</idno></series><idno type="istex">8ADA2EE3530612EA49BBE1EF913C3D65360C5DE9</idno><idno type="DOI">10.1016/S0167-8655(01)00038-1</idno><idno type="PII">S0167-8655(01)00038-1</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-8655</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This paper describes a novel procedure for thinning binary text images by generating graphical representations of words within the image. A smoothed polygonal approximation of the boundaries of each word is first decomposed into a set of contiguous triangles. Each triangle is then classified into one of only three possible types from which a graph is generated that represents the topological features of the object. Joining graph points with straight lines generates a final polygon skeleton that, by construction, is one pixel wide and fully connected. Results of applying the procedure to thinning Arabic and English handwriting are presented. Comparisons of skeleton structure and execution time with results from alternative techniques are also presented. The procedure is considerably faster than the alternatives tested when the image resolution is greater than 600 dpi and the graphical representation often needed in subsequent recognition steps is available without further processing.</div></front></TEI><affiliations><list><country><li>Royaume-Uni</li></country></list><tree><country name="Royaume-Uni"><noRegion><name sortKey="Melhi, M" sort="Melhi, M" uniqKey="Melhi M" first="M" last="Melhi">M. Melhi</name></noRegion><name sortKey="Booth, W" sort="Booth, W" uniqKey="Booth W" first="W" last="Booth">W. Booth</name><name sortKey="Ipson, S S" sort="Ipson, S S" uniqKey="Ipson S" first="S. S" last="Ipson">S. S Ipson</name><name sortKey="Ipson, S S" sort="Ipson, S S" uniqKey="Ipson S" first="S. S" last="Ipson">S. S Ipson</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001A51 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001A51 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:8ADA2EE3530612EA49BBE1EF913C3D65360C5DE9
|texte= A novel triangulation procedure for thinning hand-written text
}}
| This area was generated with Dilib version V0.6.32. |  |